Sigma Models and Phase Transitions for Complete Intersections
نویسندگان
چکیده
منابع مشابه
Criteria for complete intersections
We establish two criteria for certain local algebras to be complete intersections. These criteria play an important role in A. Wiles’s proof that all semi-stable elliptic curves over Q are modular. Introduction In this paper we discuss two results in commutative algebra that are used in A. Wiles’s proof that all semi-stable elliptic curves over Q are modular [11]. We first fix some notation tha...
متن کاملFirst - order transitions for very nonlinear sigma models
In this contribution we discuss the occurrence of first-order transitions in temperature in various short-range lattice models with a rotation symmetry. Such transitions turn out to be widespread under the condition that the interaction potentials are sufficiently nonlinear. In memory of John Lewis, who by his kind guidance and excellent scientific and professional sense has always been a stimu...
متن کامل"Semiempirical" models for biomembrane phase transitions and phase separations.
Experimental studies are reviewed to construct a model for the hydrocarbon chain disordering in “fluid” phospholipid bilayers. Together with approximate expressions for the interactions between neighboring molecules, this information is used to construct a simple statistical thermodynamic theory of the chain “melting” based on the Bragg-Williams approximation. Two unknown parameters in the theo...
متن کاملGale Duality for Complete Intersections
We show that every complete intersection defined by Laurent polynomials in an algebraic torus is isomorphic to a complete intersection defined by master functions in the complement of a hyperplane arrangement, and vice versa. We call systems defining such isomorphic schemes Gale dual systems because the exponents of the monomials in the polynomials annihilate the weights of the master functions...
متن کاملPhase Transitions of PP-Complete Satisfiability Problems
The complexity class PP consists of all decision problems solvable by polynomial-time probabilistic Turing machines. It is well known that PP is a highly intractable complexity class and that PP-complete problems are in all likelihood harder than NP-complete problems. We investigate the existence of phase transitions for a family of PPcomplete Boolean satisfiability problems under the fixed cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2017
ISSN: 1073-7928,1687-0247
DOI: 10.1093/imrn/rnx029